Program Specialization as a Tool for Solving Word Equations

Program Specialization via a Software Verification Tool

Partial evaluation is a program specialization technique that allows to optimize a program for which partial input is known. We propose a new approach to generate specialized programs for a Java-like language via the software verification tool KeY. This is achieved by symbolically executing source programs interleaved with calls to a simple partial evaluator. In a second phase the specialized p...

A numerical algorithm for solving a class of matrix equations

In this paper, we present a numerical algorithm for solving matrix equations $(A otimes B)X = F$  by extending the well-known Gaussian elimination for $Ax = b$. The proposed algorithm has a high computational efficiency. Two numerical examples are provided to show the effectiveness of the proposed algorithm.

Solving Word Equations modulo Partial Commutations

The Hardness of Solving Simple Word Equations

We investigate the class of regular-ordered word equations. The sides of such an equation contain both exactly the same variables, occurring in the same order (but separated by potentially distinct constant factors). Surprisingly, we obtain that solving even such simple equations is NP-hard. By considerations regarding the combinatorial structure of the minimal solutions of the more general qua...

A Numerical Method For Solving Ricatti Differential Equations

By adding a suitable real function on both sides of the quadratic Riccati differential equation, we propose a weighted type of Adams-Bashforth rules for solving it, in which moments are used instead of the constant coefficients of Adams-Bashforth rules. Numerical results reveal that the proposed method is efficient and can be applied for other nonlinear problems.